Venetian Elections and Lot-based Voting Rules
نویسندگان
چکیده
Between 1268 and 1797, the Venetian Republic used a complicated voting system that appears designed to resist manipulation. The system starts with randomly drawing voters, followed by 8 rounds of a complicated addition and elimination of voters before the approval voting rule is finally used to select the winner, the new Doge. In this paper, we study a family of voting rules inspired by this Venetian election system, which we call lot-based voting rules. Such rules have two steps: in the first step, k votes are selected by a lottery, then in the second round (the runoff), a voting rule is applied to select the winner based on these k votes. We study some normative properties of such lot-based rules. We also investigate the computational complexity of computing the winner with weighted and unweighted votes, and of computing manipulations. Finally, we propose an efficient sampling technique for generating the k runoff voters non-uniformly.
منابع مشابه
The Complexity of Multiwinner Voting Rules with Variable Number of Winners
We consider the approval-based model of elections, and undertake a computational study of voting rules which select committees whose size is not predetermined. While voting rules that output committees with a predetermined number of winning candidates are quite well studied, the study of elections with variable number of winners has only recently been initiated by Kilgour [18]. This paper aims ...
متن کاملVoting by Adaptive Agents in Multi-Candidate Elections
Here we investigate how strategic adaptation changes our understanding and predictions of voting systems. We model populations of agents voting in multiple elections over time that revise their voting strategies based on electoral outcomes. Using this framework we examine the dynamic formation of electoral outcomes. Allowing agents to adapt their strategies refines the predictions of rational c...
متن کاملDistributed Monitoring of Election Winners
We consider distributed elections, where there is a center and k sites. In such distributed elections, each voter has preferences over some set of candidates, and each voter is assigned to exactly one site such that each site is aware only of the voters assigned to it. The center is able to directly communicate with each of the sites. We are interested in designing communication-efficient proto...
متن کاملDistance rationalization of voting rules
The concept of distance rationalizability allows one to define new voting rules or rationalize existing ones via a consensus, i.e., a class of elections that have a unique, indisputable winner, and a distance over elections: A candidate is declared an election winner if she is the consensus candidate in one of the nearest consensus elections. Many classic voting rules are defined or can be repr...
متن کاملThe Random Pairs Voting Rule: Introduction and Evaluation With a Large Dataset
This paper introduces and evaluates the Random Pairs voting rule to show that it significantly improves upon the communication complexity of balloting methods requiring complete orderings of candidates while maintaining a high Condorcet efficiency. To this end, Random Pairs is compared to plurality, 2-approval, Borda, and range voting on elections constructed from Yahoo! users’ ratings of music...
متن کامل